The mean-field computation in a supermarket model with server multiple vacations
نویسندگان
چکیده
While vacation processes are considered to be ordinary behavior for servers, the study of queueing networks with server vacations is limited, interesting, and challenging. In this paper, we provide a unified and effective method of functional analysis for the study of a supermarket model with server multiple vacations. Firstly, we analyze a supermarket model of N identical servers with server multiple vacations, and set up an infinite-dimensional system of differential (or mean-field) equations, which is satisfied by the expected fraction vector, in terms of a technique of tailed equations. Secondly, as N → ∞ we use the operator semigroup to provide a mean-field limit for the sequence of Markov processes, which asymptotically approaches a single trajectory identified by the unique and global solution to the infinite-dimensional system of limiting differential equations. Thirdly, we provide an effective algorithm for computing the fixed point of the infinite-dimensional system of limiting differential equations, and use the fixed point to give performance analysis of this supermarket model, including the mean of stationary queue length in any server and the expected sojourn time that any arriving customer spends in this system. Finally, we use some numerical examples to analyze how the performance measures depend on some crucial factors of this supermarket model. Note that the method of this paper will be useful and effective for performance analysis of Q.-L. Li (B) · G. Dai School of Economics and Management Sciences, Yanshan University, Qinhuangdao 066004, People’s Republic of China e-mail: [email protected] J. C. S. Lui Department of Computer Science & Engineering, The Chinese University of Hong Kong, Shatin, NT, Hong Kong Y. Wang Institute of Network Computing & Information Systems, Peking University, Beijing 100871, People’s Republic of China Discrete Event Dyn Syst complicated supermarket models with respect to resource management in practical areas such as computer networks, manufacturing systems and transportation networks.
منابع مشابه
Discrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers
This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...
متن کاملFinite Capacity Queuing System with Vacations and Server Breakdowns
This paper deals with finite capacity single server queuing system with vacations. Vacation starts at rate nu if the system is empty. Also the server takes another vacation if upon his arrival to the system, finds the system empty. Customers arrive in the system in Poisson fashion at rate lamda0 during vacation, faster rate lamdaf during active service and slower rate lamdas during the breakdow...
متن کاملPerishable Inventory Model with Retrial Demands, Negative Customers and Multiple Working Vacations
This paper presents the analysis of a continuous review perishable inventory system wherein the life time of each item follows an exponential distribution. The operating policy is (s,S) policy where the ordered items are received after a random time which follows exponential distribution. Primary arrival follows Poisson distribution and they may turnout to be posit...
متن کاملTailed Probabilities in Queueing Processes
In the study of large scale stochastic networks with resource management, differential equations and mean-field limits are two key techniques. Recent research shows that the expected fraction vector (that is, the tail probability vector) plays a key role in setting up mean-field differential equations. To further apply the technique of tail probability vector to deal with resource management of...
متن کاملAlgorithmic approach to Markovian multi-server retrial queues with vacations
There are many practical situations that have both features of customer retrials and server vacations. The vacation policy is characterized by the vacation startup rules and vacation termination rules. The queueing system with retrials and vacations has been described in variety of ways according to the vacation rules and retrial policies such as constant retrial policy and linear retrial polic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Event Dynamic Systems
دوره 24 شماره
صفحات -
تاریخ انتشار 2014